package programmercarl.动态规划.C4;

class Solution1 {
    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        //dp含义表示爬到当前楼梯要花费的最少费用
        dp[1] = 0;
        for (int i = 3; i <= n; i++) {
            dp[i] = Math.min(dp[i - 1]+cost[i-1], dp[i - 2]+cost[i-2]);
        }
        return dp[n];
    }
}